A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability
نویسندگان
چکیده
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
منابع مشابه
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satis ability ∗
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
متن کاملA constructive quantum Lovasz local lemma for commuting projectors
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lovász Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable [AKS12], by generalizing the classical Lovász Local Lemma. The next natural question that arises is: can a satisfying quant...
متن کاملA Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma
We provide a simple algorithmic proof for the symmetric Lopsided Lovász Local Lemma, a variant of the classic Lovász Local Lemma, where, roughly, only the degree of the negatively correlated undesirable events counts. Our analysis refers to the algorithm by Moser in 2009, however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the...
متن کاملConstructive Proof of Lovász Local Lemma
Let A be a finite collection of mutually independent “bad” events (ones we wish to avoid) in a probability space Ω. The probability of none of these events happening is exactly ∏ A∈A(1−Pr [A]). In particular, this probability is positive whenever no event in A has probability 1. What if the events in A are not mutually independent but has limited dependence? Let Γ(A) ⊆ A be the subset of events...
متن کاملExact algorithms for constraint satisfaction problems
The Boolean satisfiability problem (SAT) and its generalization to variables of higher arities – constraint satisfaction problems (CSP) – can arguably be called the most “natural” of all NP-complete problems. The present work is concerned with their algorithmic treatment. It consists of two parts. The first part investigates CSPs for which satisfiability follows from the famous Lovász Local Lem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 461 شماره
صفحات -
تاریخ انتشار 2011